Weak convergence of conditioned birth-death processes in discrete time
نویسندگان
چکیده
منابع مشابه
Representations for the rate of convergence of birth-death processes
We display some representations for the rate of convergence of a birth-death process, which are useful for obtaining upper and lower bounds. The expressions are brought to light by exploiting the spectral representation for the transition probabilities of a birth-death process and results from the theory of orthogonal polynomials.
متن کاملOn the Convergence to Stationarity of Birth-death Processes
Taking up a recent proposal by Stadje and Parthasarathy in the setting of the many-server Poisson queue, we consider the integral ∫∞ 0 [limu→∞E(X(u))− E(X(t))]dt as a measure of the speed of convergence towards stationarity of the process {X(t), t ≥ 0}, and evaluate the integral explicitly in terms of the parameters of the process in the case that {X(t), t ≥ 0} is an ergodic birth-death process...
متن کاملOn $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes
In the present paper we investigate the $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes with general state spaces. We provide a necessary and sufficient condition for such processes to satisfy the $L_1$-weak ergodicity. Moreover, we apply the obtained results to establish $L_1$-weak ergodicity of quadratic stochastic processes.
متن کاملDiscrete evolutionary birth-death processes and their large population limits
We study a class of discrete-state Markovian models of evolutionary population dynamics for k types of organisms, called discrete evolutionary birth-death processes (EBDP). The organisms in a model environment interact with each other by playing a certain game. Birth rates for type i organisms at time t are determined by their expected payoff in the game against an opponent chosen randomly from...
متن کاملAdditive Functionals for Discrete-time Markov Chains with Applications to Birth–death Processes
In this paper we are interested in bounding or calculating the additive functionals of the first return time on a set for discrete-time Markov chains on a countable state space, which is motivated by investigating ergodic theory and central limit theorems. To do so, we introduce the theory of the minimal nonnegative solution. This theory combined with some other techniques is proved useful for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 1997
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200100683